Adaptive location update area design for wireless cellular networks under 2D Markov walk model
نویسندگان
چکیده
In wireless cellular networks, location management operation expends the limited wireless resources to keep track the location information of a mobile terminal. Various dynamic location update (LU) schemes have been proposed to improve the efficiency of location management. However, most of them only work for certain mobility patterns. In this paper, we propose a new scheme that the LU area is adaptively designed according to the mobility pattern and traffic parameters. The 2D Markov walk is used as the mobility model which describes a broad class of mobility patterns. A recursive algorithm is developed to compute the location management cost of a general LU area shape. Due to the high computational complexity of the adaptive LU area design problem, we use an iterative greedy heuristic algorithm to find an approximation solution of the problem efficiently. The effects of the mobility patterns and traffic parameters on the designed LU area shape are investigated. Experimental results show that the LU area designed by the heuristic algorithm can adaptively change according to the given mobility pattern and traffic parameters. Compared with some existing dynamic LU schemes, the proposed adaptive LU scheme is more flexible and efficient for location management. 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Design and evaluation of two scalable protocols for location management of mobile nodes in location based routing protocols in mobile Ad Hoc Networks
Heretofore several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network.Our solutions decrease location update without loss of query success rate or throughput and even increase those.Simulation results show that our methods are effectiv...
متن کاملDesign and evaluation of two scalable protocols for location management of mobile nodes in location based routing protocols in mobile Ad Hoc Networks
Heretofore several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network.Our solutions decrease location update without loss of query success rate or throughput and even increase those.Simulation results show that our methods are effectiv...
متن کاملLeZi-Update: An Information-Theoretic Framework for Personal Mobility Tracking in PCS Networks
The complexity of the mobility tracking problem in a cellular environment has been characterized under an information-theoretic framework. Shannon’s entropy measure is identified as a basis for comparing user mobility models. By building and maintaining a dictionary of individual user’s path updates (as opposed to the widely used location updates), the proposed adaptive on-line algorithm can le...
متن کاملAn adaptive distance-based location update algorithm for next-generation PCS networks
In this paper, we propose a stochastic model to compute the optimal update boundary for the distance-based location update algorithm. The proposed model is flexible and captures some of the real characteristics in the wireless cellular environment. The model can adapt to arbitrary cell topologies in which the number of neighboring base stations at different locations may vary. The cell residenc...
متن کاملA Double Herd Krill Based Algorithm for Location Area Optimization in Mobile Wireless Cellular Network
In wireless communication systems, mobility tracking deals with determining a mobile subscriber (MS) covering the area serviced by the wireless network. Tracking a mobile subscriber is governed by the two fundamental components called location updating (LU) and paging. This paper presents a novel hybrid method using a krill herd algorithm designed to optimize the location area (LA) within avail...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Communications
دوره 30 شماره
صفحات -
تاریخ انتشار 2007